package demo1;

public class HashBucket2<K, V> {
    static class Node<K, V> {
        public K key;
        public V val;
        public Node<K, V> next;
        public Node(K key, V val) {
            this.key = key;
            this.val = val;
        }
    }

    private Node<K, V>[] array;
    private int usedSize;
    private static final float DEFAULT_LOAD_FACTORY = .75f;

    public HashBucket2() {
        this.array = (Node<K, V>[]) new Node[10];
    }

    public void put(K key, V val) {
        int index = key.hashCode() % array.length;
        Node<K, V> cur = array[index];
        while(cur != null) {
            if(cur.key.equals(key)) {
                cur.val = val;
                return;
            }
            cur = cur.next;
        }

        Node<K, V> node = new Node<>(key, val);
        node.next = array[index];
        array[index] = node;
        usedSize++;
    }

    public V get(K key) {
        int index = key.hashCode() % array.length;
        Node<K, V> cur = array[index];

        while(cur != null) {
            if(cur.key.equals(key)) {
                return cur.val;
            }
            cur = cur.next;
        }

        return null;
    }
}
